Collision detection for deforming necklaces

Cylindrical Hierarchy for Deforming Necklaces

Recently, Guibas et al. 10 studied deformable necklaces – flexible chains of balls, called beads, in which only adjacent balls can intersect. In this paper, we investigate the problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with n beads in R by k cylinders can be computed in pol...

Self-collision Detection for Deforming Cables

Detecting self-collision for cables and similar objects is an important part of numerous models in computational biology (protein chains), robotics (electric cables), hair modeling, computer graphics, etc. In this paper the 1D sweep-and-prune algorithm for detecting self-collisions of a deforming cable comprising linear segments is investigated. The sweep-and-prune algorithm is compared with ot...

Collision Detection for Continuously Deforming Bodies

Fast and accurate collision detection between geometric bodies is essential in application areas like virtual reality, animation, simulation, games and robotics. In this work, we address the collision detection problem in applications where deformable bodies are used, which change their overall shape every time step of the simulation. We propose and evaluate suitable bounding volume trees for d...

A Combination of Hierarchical Structures and Particle Systems for Self-Collision Detection of Deforming Objects

In this paper, we propose an approach which combines hierarchical structures and particle systems for self-collision detection occurring in a deformable object. Numerous algorithms for collision detection have been proposed in computer graphics applications. Our algorithm exploits the efficiency of hierarchical structures to deal with many polygons, and particle systems because they can be used...

New geometric algorithms and data structures for collision detection of dynamically deforming objects